Learning to transform sensitive data with variable distribution preservation

ABSTRACT

Preserving distributions of data values of a data asset in a data anonymization operation is provided. Anonymizing data values is performed by transforming sensitive data in a set of columns over rows of the data asset while preserving distribution of the data values in the set of transformed columns to a defined degree using a set of autoencoders and loss function. The autoencoders are base trained from preexisting data in a data assets catalog and actively trained during data dissemination. Parametric coefficients of the loss function are configured and the threshold is generated using policies from an enforcement decision for the data asset and data consumer. The loss function value of a selected row is compared to the threshold. Transformed data values of the selected row are transcribed to an output row when the loss function value is greater than the threshold and disseminated to the data consumer.

BACKGROUND 1. Field

The disclosure relates generally to a system for data security/privacyand more specifically to dynamically transforming sensitive data of adata asset in real time during data dissemination to a data consumer.The specific transformation to data during an anonymization operation isachieved while attempting to preserve the data distribution of theoutput transformed values, to a desired degree relative to the inputdata. This is achieved by using an autoencoder for the transformationand a policy-based parameterized loss function for data distributioncontrol.

2. Description of the Related Art

Data dissemination is the distribution or transmitting of data to a dataconsumer. A data consumer may be, for example: a human; an entity, suchas a business, enterprise, company, organization, institution, oragency; a software application; an online service; or the like. Datasecurity is the process of protecting data by adopting a set of policiesthat identify the relative importance of different data sets, sensitivenature of the different data sets, and regulatory compliancerequirements corresponding to the different data sets, and then applyingappropriate policies to secure a given data set. Elements of datasecurity may include confidentiality, integrity, and availability. Theseelements can be used as a guide to keep sensitive data protected fromunauthorized access. For example, confidentiality ensures that data isaccessed only by authorized users. Integrity ensures that data areaccurate. Availability ensures that data are available and accessible tosatisfy a data consumer's needs.

Data privacy is the relationship between the collection anddissemination of data, expectation of data privacy, and regulatoryissues surrounding them. Data privacy presents a challenge since dataprivacy attempts to use data, while protecting an individual's sensitivedata or personally identifiable information. Personally identifiableinformation is any information, such as, for example, name, address,telephone number, social security number, or the like, corresponding toan identifiable person that can be used to identify that particularperson.

SUMMARY

According to one illustrative embodiment, a computer-implemented methodfor preserving distributions of data values of a data asset in a dataanonymization operation is provided. Data anonymizations of a selectedrow in the data asset are performed using an autoencoder fortransforming data values of sensitive data in an associated set of rowcells of columns of interest to a transform buffer. A loss functionvalue is generated for the data anonymizations in the selected row usinga loss function with parametric coefficients specified in a policyenforcement decision. The loss function value is compared to a lossfunction threshold value. Transformed data values in the transformbuffer are transcribed using forward mapping to real row cell valuessuitable for a specific user to an output buffer labeled as output inresponse to determining that the loss function value is greater than theloss function threshold value based on the comparing. The output bufferlabeled output is transferred to a next row for an output of the dataasset. According to other illustrative embodiments, a computer systemand computer program product for preserving distributions of data valuesof a data asset in a data anonymization operation are provided.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a pictorial representation of a network of data processingsystems in which illustrative embodiments may be implemented;

FIG. 2 is a diagram of a data processing system in which illustrativeembodiments may be implemented;

FIG. 3 is a diagram illustrating an example of a data discovery, dataclassification, and autoencoder base training and library maintenanceprocess in accordance with an illustrative embodiment;

FIG. 4 is a diagram illustrating an example of a dynamic datadissemination with policy enforcement and active autoencoder trainingprocess in accordance with an illustrative embodiment;

FIG. 5 is a diagram illustrating an specific example of an autoencoderwith loss function in accordance with an illustrative embodiment;

FIG. 6 is a flowchart illustrating a process for data classification andautoencoder base training in accordance with an illustrative embodiment;and

FIGS. 7A-7C are a flowchart illustrating a process for policyenforcement to transform sensitive data in accordance with anillustrative embodiment.

DETAILED DESCRIPTION

The present invention may be a system, a method, and/or a computerprogram product at any possible technical detail level of integration.The computer program product may include a computer-readable storagemedium (or media) having computer-readable program instructions thereonfor causing a processor to carry out aspects of the present invention.

The computer-readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer-readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer-readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer-readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer-readable program instructions described herein can bedownloaded to respective computing/processing devices from acomputer-readable storage medium or to an external computer or externalstorage device via a network, for example, the Internet, a local areanetwork, a wide area network and/or a wireless network. The network maycomprise copper transmission cables, optical transmission fibers,wireless transmission, routers, firewalls, switches, gateway computersand/or edge servers. A network adapter card or network interface in eachcomputing/processing device receives computer-readable programinstructions from the network and forwards the computer-readable programinstructions for storage in a computer-readable storage medium withinthe respective computing/processing device.

Computer-readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, configuration data for integrated circuitry, oreither source code or object code written in any combination of one ormore programming languages, including an object oriented programminglanguage such as Smalltalk, C++, or the like, and procedural programminglanguages, such as the “C” programming language or similar programminglanguages. The computer-readable program instructions may executeentirely on the user's computer, partly on the user's computer, as astand-alone software package, partly on the user's computer and partlyon a remote computer or entirely on the remote computer or server. Inthe latter scenario, the remote computer may be connected to the user'scomputer through any type of network, including a local area network(LAN) or a wide area network (WAN), or the connection may be made to anexternal computer (for example, through the Internet using an InternetService Provider). In some embodiments, electronic circuitry including,for example, programmable logic circuitry, field-programmable gatearrays (FPGA), or programmable logic arrays (PLA) may execute thecomputer-readable program instructions by utilizing state information ofthe computer-readable program instructions to personalize the electroniccircuitry, in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer-readable program instructions.

These computer-readable program instructions may be provided to aprocessor of a computer, or other programmable data processing apparatusto produce a machine, such that the instructions, which execute via theprocessor of the computer or other programmable data processingapparatus, create means for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks. Thesecomputer-readable program instructions may also be stored in acomputer-readable storage medium that can direct a computer, aprogrammable data processing apparatus, and/or other devices to functionin a particular manner, such that the computer-readable storage mediumhaving instructions stored therein comprises an article of manufactureincluding instructions which implement aspects of the function/actspecified in the flowchart and/or block diagram block or blocks.

The computer-readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the blocks may occur out of theorder noted in the Figures. For example, two blocks shown in successionmay, in fact, be accomplished as one step, executed concurrently,substantially concurrently, in a partially or wholly temporallyoverlapping manner, or the blocks may sometimes be executed in thereverse order, depending upon the functionality involved. It will alsobe noted that each block of the block diagrams and/or flowchartillustration, and combinations of blocks in the block diagrams and/orflowchart illustration, can be implemented by special purposehardware-based systems that perform the specified functions or acts orcarry out combinations of special purpose hardware and computerinstructions.

With reference now to the figures, and in particular, with reference toFIG. 1 and FIG. 2 , diagrams of data processing environments areprovided in which illustrative embodiments may be implemented. It shouldbe appreciated that FIG. 1 and FIG. 2 are only meant as examples and arenot intended to assert or imply any limitation with regard to theenvironments in which different embodiments may be implemented. Manymodifications to the depicted environments may be made.

FIG. 1 depicts a pictorial representation of a network of dataprocessing systems in which illustrative embodiments may be implemented.Network data processing system 100 is a network of computers, dataprocessing systems, and other devices in which the illustrativeembodiments may be implemented. Network data processing system 100contains network 102, which is the medium used to provide communicationslinks between the computers, data processing systems, and other devicesconnected together within network data processing system 100. Network102 may include connections, such as, for example, wire communicationlinks, wireless communication links, fiber optic cables, and the like.

In the depicted example, server 104 and server 106 connect to network102, along with storage 108. Server 104 and server 106 may be, forexample, server computers with high-speed connections to network 102. Inaddition, server 104 and server 106 provide one or more data privacyservices by physically transforming sensitive data of a user requesteddata asset (e.g., a rectangular data set comprised of columns and rows)to anonymized data values while preserving distribution of the values ofthe data asset to a defined degree based on policy using an autoencoderwith loss function. Also, it should be noted that server 104 and server106 may each represent a cluster of servers in one or more data centers.Alternatively, server 104 and server 106 may each represent multiplecomputing nodes in one or more cloud environments.

Client 110, client 112, and client 114 also connect to network 102.Clients 110, 112, and 114 are clients of server 104 and server 106. Inthis example, clients 110, 112, and 114 are shown as desktop or personalcomputers with wire communication links to network 102. However, itshould be noted that clients 110, 112, and 114 are examples only and mayrepresent other types of data processing systems, such as, for example,network computers, laptop computers, handheld computers, smart phones,smart televisions, and the like, with wire or wireless communicationlinks to network 102. Users (i.e., data consumers) corresponding toclients 110, 112, and 114 may utilize clients 110, 112, and 114 toaccess data assets hosted or protected by server 104 and server 106. Thedata assets hosted or protected by server 104 and server 106 may be anytype of data set (e.g., transaction data, marketing data, financialdata, healthcare data, or the like), which contains sensitive data(e.g., name, address, telephone number, social security number, creditcard number, and the like) that can personally identify individuals andis not available for access without specific consent by the individuals.

Storage 108 is a network storage device capable of storing any type ofdata in a structured format or an unstructured format. In addition,storage 108 may represent a plurality of network storage devices.Further, storage 108 may store a plurality of different data assets,which are protected by server 104 and server 106. Furthermore, storage108 may store other types of data, such as authentication or credentialdata that may include usernames, passwords, and biometric templatesassociated with client device users, for example.

In addition, it should be noted that network data processing system 100may include any number of additional servers, clients, storage devices,and other devices not shown. Program code located in network dataprocessing system 100 may be stored on a computer-readable storagemedium or a set of computer-readable storage media and downloaded to acomputer or other data processing device for use. For example, programcode may be stored on a computer-readable storage medium on server 104and downloaded to client 110 over network 102 for use on client 110.

In the depicted example, network data processing system 100 may beimplemented as a number of different types of communication networks,such as, for example, an internet, an intranet, a wide area network(WAN), a local area network (LAN), a telecommunications network, or anycombination thereof. FIG. 1 is intended as an example only, and not asan architectural limitation for the different illustrative embodiments.

As used herein, when used with reference to items, “a number of” meansone or more of the items. For example, “a number of different types ofcommunication networks” is one or more different types of communicationnetworks. Similarly, “a set of,” when used with reference to items,means one or more of the items.

Further, the term “at least one of,” when used with a list of items,means different combinations of one or more of the listed items may beused, and only one of each item in the list may be needed. In otherwords, “at least one of” means any combination of items and number ofitems may be used from the list, but not all of the items in the listare required. The item may be a particular object, a thing, or acategory.

For example, without limitation, “at least one of item A, item B, oritem C” may include item A, item A and item B, or item B. This examplemay also include item A, item B, and item C or item B and item C. Ofcourse, any combinations of these items may be present. In someillustrative examples, “at least one of” may be, for example, withoutlimitation, two of item A; one of item B; and ten of item C; four ofitem B and seven of item C; or other suitable combinations.

With reference now to FIG. 2 , a diagram of a data processing system isdepicted in accordance with an illustrative embodiment. Data processingsystem 200 is an example of a computer, such as server 104 in FIG. 1 ,in which computer-readable program code or instructions implementing thedata privacy processes of illustrative embodiments may be located. Inthis example, data processing system 200 includes communications fabric202, which provides communications between processor unit 204, memory206, persistent storage 208, communications unit 210, input/output (I/O)unit 212, and display 214.

Processor unit 204 serves to execute instructions for softwareapplications and programs that may be loaded into memory 206. Processorunit 204 may be a set of one or more hardware processor devices or maybe a multi-core processor, depending on the particular implementation.

Memory 206 and persistent storage 208 are examples of storage devices216. As used herein, a computer-readable storage device or acomputer-readable storage medium is any piece of hardware that iscapable of storing information, such as, for example, withoutlimitation, data, computer-readable program code in functional form,and/or other suitable information either on a transient basis or apersistent basis. Further, a computer-readable storage device or acomputer-readable storage medium excludes a propagation medium, such astransitory signals. Furthermore, a computer-readable storage device or acomputer-readable storage medium may represent a set ofcomputer-readable storage devices or a set of computer-readable storagemedia. Memory 206, in these examples, may be, for example, arandom-access memory (RAM), or any other suitable volatile ornon-volatile storage device, such as a flash memory. Persistent storage208 may take various forms, depending on the particular implementation.For example, persistent storage 208 may contain one or more devices. Forexample, persistent storage 208 may be a disk drive, a solid-statedrive, a rewritable optical disk, a rewritable magnetic tape, or somecombination of the above. The media used by persistent storage 208 maybe removable. For example, a removable hard drive may be used forpersistent storage 208.

In this example, persistent storage 208 stores data distributionpreserver 218. However, it should be noted that even though datadistribution preserver 218 is illustrated as residing in persistentstorage 208, in an alternative illustrative embodiment, datadistribution preserver 218 may be a separate component of dataprocessing system 200. For example, data distribution preserver 218 maybe a hardware component coupled to communication fabric 202 or acombination of hardware and software components. In another alternativeillustrative embodiment, a first set of components of data distributionpreserver 218 may be located in data processing system 200 and a secondset of components of data distribution preserver 218 may be located in asecond data processing system, such as, for example, server 106 in FIG.1 .

Data distribution preserver 218 controls the process of dynamicallytransforming sensitive data of a data asset in real time during datadissemination to a requesting data consumer. Data distribution preserver218 achieves the specific transformation to the requested data during ananonymization operation preserving the transformed values of the outputdata distributions to a desired degree relative to the input data. Datadistribution preserver 218 controls this anonymization operationdeclaratively based on policy using an autoencoder with parametrizedloss function.

As a result, data processing system 200 operates as a special purposecomputer system in which data distribution preserver 218 in dataprocessing system 200 enables transformation of sensitive data within adata asset while preserving distribution of the original data asset. Inparticular, data distribution preserver 218 transforms data processingsystem 200 into a special purpose computer system as compared tocurrently available general computer systems that do not have datadistribution preserver 218.

Communications unit 210, in this example, provides for communicationwith other computers, data processing systems, and devices via anetwork, such as network 102 in FIG. 1 . Communications unit 210 mayprovide communications through the use of both physical and wirelesscommunications links. The physical communications link may utilize, forexample, a wire, cable, universal serial bus, or any other physicaltechnology to establish a physical communications link for dataprocessing system 200. The wireless communications link may utilize, forexample, shortwave, high frequency, ultrahigh frequency, microwave,wireless fidelity (Wi-Fi), Bluetooth® technology, global system formobile communications (GSM), code division multiple access (CDMA),second-generation (2G), third-generation (3G), fourth-generation (4G),4G Long Term Evolution (LTE), LTE Advanced, fifth-generation (5G), orany other wireless communication technology or standard to establish awireless communications link for data processing system 200.

Input/output unit 212 allows for the input and output of data with otherdevices that may be connected to data processing system 200. Forexample, input/output unit 212 may provide a connection for user inputthrough a keypad, a keyboard, a mouse, a microphone, and/or some othersuitable input device. Display 214 provides a mechanism to displayinformation to a user and may include touch screen capabilities to allowthe user to make on-screen selections through user interfaces or inputdata, for example.

Instructions for the operating system, applications, and/or programs maybe located in storage devices 216, which are in communication withprocessor unit 204 through communications fabric 202. In thisillustrative example, the instructions are in a functional form onpersistent storage 208. These instructions may be loaded into memory 206for running by processor unit 204. The processes of the differentembodiments may be performed by processor unit 204 usingcomputer-implemented instructions, which may be located in a memory,such as memory 206. These program instructions are referred to asprogram code, computer usable program code, or computer-readable programcode that may be read and run by a processor in processor unit 204. Theprogram instructions, in the different embodiments, may be embodied ondifferent physical computer-readable storage devices, such as memory 206or persistent storage 208.

Program code 220 is located in a functional form on computer-readablemedia 222 that is selectively removable and may be loaded onto ortransferred to data processing system 200 for running by processor unit204. Program code 220 and computer-readable media 222 form computerprogram product 224. In one example, computer-readable media 222 may becomputer-readable storage media 226 or computer-readable signal media228.

In these illustrative examples, computer-readable storage media 226 is aphysical or tangible storage device used to store program code 220rather than a medium that propagates or transmits program code 220.Computer-readable storage media 226 may include, for example, an opticalor magnetic disc that is inserted or placed into a drive or other devicethat is part of persistent storage 208 for transfer onto a storagedevice, such as a hard drive, that is part of persistent storage 208.Computer-readable storage media 226 also may take the form of apersistent storage, such as a hard drive, a thumb drive, or a flashmemory that is connected to data processing system 200.

Alternatively, program code 220 may be transferred to data processingsystem 200 using computer-readable signal media 228. Computer-readablesignal media 228 may be, for example, a propagated data signalcontaining program code 220. For example, computer-readable signal media228 may be an electromagnetic signal, an optical signal, or any othersuitable type of signal. These signals may be transmitted overcommunication links, such as wireless communication links, an opticalfiber cable, a coaxial cable, a wire, or any other suitable type ofcommunications link.

Further, as used herein, “computer-readable media 222” can be singularor plural. For example, program code 220 can be located incomputer-readable media 222 in the form of a single storage device orsystem. In another example, program code 220 can be located incomputer-readable media 222 that is distributed in multiple dataprocessing systems. In other words, some instructions in program code220 can be located in one data processing system while otherinstructions in program code 220 can be located in one or more otherdata processing systems. For example, a portion of program code 220 canbe located in computer-readable media 222 in a server computer whileanother portion of program code 220 can be located in computer-readablemedia 222 located in a set of client computers.

The different components illustrated for data processing system 200 arenot meant to provide architectural limitations to the manner in whichdifferent embodiments can be implemented. In some illustrative examples,one or more of the components may be incorporated in or otherwise form aportion of, another component. For example, memory 206, or portionsthereof, may be incorporated in processor unit 204 in some illustrativeexamples. The different illustrative embodiments can be implemented in adata processing system including components in addition to or in placeof those illustrated for data processing system 200. Other componentsshown in FIG. 2 can be varied from the illustrative examples shown. Thedifferent embodiments can be implemented using any hardware device orsystem capable of running program code 220.

In another example, a bus system may be used to implement communicationsfabric 202 and may be comprised of one or more buses, such as a systembus or an input/output bus. Of course, the bus system may be implementedusing any suitable type of architecture that provides for a transfer ofdata between different components or devices attached to the bus system.

In dynamic data dissemination where data access is controlled bypolicies, it is apparent that each data consumer (e.g., user in a usercontext) accessing data through the dissemination layer could encountera different applicable transformation of values of that data, which isvisible to that particular data consumer. It is prohibitive in terms ofstorage and compute resource costs to pre-process every known data asseta priori for each different data consumer. As a result, a system isneeded where the data assets are in raw form and, at each instance ofdata access, the system would perform necessary data transformations asfast as possible. This system would require a fast transformation methodusing a stateless approach to rows of data so streaming can be used.Also, in most data consumption use cases, there should be a parametricapproach to a loss function to determine the tradeoff between datautility and data privacy needs. This parametric approach to a lossfunction requires yet another mechanism that needs to be present overand above the actual act of data transformation. However, this approachdoes not currently exist in data transformation systems today.

Current systems that perform data transformation rely on costlyclassical deterministic, algorithmic transformation methods, such astokenization, redaction, obfuscation, and the like. Each of thesemethods require a specific transformation type implementation. Some ofthese transformation types are highly stateful requiring full processingof the source data asset before attempting to generate the first outputrow of data (i.e., tuple), which prevents data streaming use cases.

Few systems attempt to preserve distribution of the data transformationoutput. In addition, these systems sacrifice row data integrity and areknown to be singular column based. Illustrative embodiments utilize atrained autoencoder that generates the necessary data physicaltransformations using tunable parametric coefficients of a loss functionthat achieves the necessary variability of the data value distribution.An autoencoder is a type of artificial neural network used to learn inan unsupervised manner. In other words, an autoencoder does not requirelabeled input data to enable learning. Typically, an autoencoder has aninput layer, one or more internal hidden layers that perform the dataprocessing, and an output layer. The training of an autoencoder isperformed through backpropagation.

For each row of data in the data asset to be transformed, illustrativeembodiments select the columns (e.g., attributes) of interest in thedata asset that need transformation as input to the autoencoder withloss function of illustrative embodiments. Illustrative embodimentsselect the columns based on one or more policies. A policy includes, forexample, a column of interest, such as name, salary, address, socialsecurity number, credit card number, or any other type of sensitiveinformation, that needs transformation prior to access to suchinformation by a particular data consumer (e.g., user) in a particularcontext, such as geolocation when requesting access, time of day of theaccess request, role when requesting the access, and the like. Aspecific example of a policy may be, “if data asset is sensitive anddata asset contains name and data asset contains salary, then transform(pseudo-anonymize (name, salary) preserve distribution 0.75)”. Thisspecific example indicates a sample instance of a set of possiblepolicies that drives a policy enforcement decision and subsequenttransformation of a requested data asset preserving distribution ofvalues of the requested data asset to a defined degree based on policyat dissemination time.

The policy may also include a best fitting statistical distribution,such as a normal distribution, lognormal distribution, betadistribution, or the like, for the column of interest, along withparameters for the best fitting statistical distribution, such as mean,minimum, maximum, and the like. In addition, the policy may includeparametric coefficients for the loss function, such as a parametriccoefficient “ρ” (rho) measuring an amount of variance within a column ofinterest between data asset input and data asset output, a parametriccoefficient “ϕ” (phi) measuring an amount of variance in columns ofinterest within a row between data asset input and data asset output,and a parametric coefficient “τ” (tau) measuring an amount of variancein the mean of the columns of interest over the entire data assetbetween data asset input and data asset output, for balancing datautility needs of data consumers and data privacy needs of individuals.High data utility for data consumers means data that have values closeto the original data values. High data privacy for individuals meansdata that do not expose any sensitive information.

It should be noted that illustrative embodiments may select theautoencoder from a library of autoencoders for a specific data asset, aspecific column of interest containing a relevant data class in a dataasset, a group of columns of interest in a data asset, or a specific rowin a column of interest. Illustrative embodiments may utilize a2-dimensional arrangement of the autoencoder library. For example, thefirst dimension may be based on columns of interest containing relevantdata classes and the second dimension may be based on data utilityversus data privacy needs. The second dimension may be, for example,coarse values of the loss function corresponding to choice of depth ofvalue distribution preservation to a predefined degree, such as X % ofvalue distribution preservation, for the data asset output as dictatedby policy.

Illustrative embodiments can train the autoencoder from any data assetinput, whether that be all available data assets or a subset of dataassets based on a desired type or category of data asset. Also, itshould be noted that the loss function parametric coefficient rho is ona sliding scale. For example, if the value of rho is zero, then completedata privacy and no data utility exists as the autoencoder will generaterandom values for the row cells of the columns of interest because theloss function is not incentivized to take into account how close theoutput of the data asset is to the input of the data asset. Conversely,if the value of rho is as large as possible, then no data privacy andcomplete data utility exists because the data asset output will besimilar to the data asset input. Further, the loss function parametriccoefficient phi is also on a sliding scale. For example, the value ofphi controls the amount of variance between two columns of interest inthe data asset input versus the amount of variance between the same twocolumns of interest in the data asset output. This comparison capturesdependence between columns of interest.

To control the balance between data privacy and data utility needs,illustrative embodiments utilize a classical or standard deterministictransformation method to observe different data asset outputs by varyingthe loss function parametric coefficients rho and phi. The classicaldeterministic transformation method provides ground truth in trainingthe autoencoders. Active autoencoder learning is based onbackpropagation of computed loss function values as reinforcement orpenalty when compared to a defined loss function threshold value. Forexample, a computed loss function value over the defined threshold istreated as reinforcement and a computed loss function value under thedefined threshold is treated as a penalty.

Furthermore, illustrative embodiments minimize disclosure of sensitivedata (e.g., unlinkability) by computing entropy of the input data asset.Entropy quantifies the amount of uncertainty involved in the values ofthe input data asset. Illustrative embodiments also determine an entropythreshold for the input data asset. In addition, illustrativeembodiments may define a policy to also include the entropy threshold.Illustrative embodiments may generate a policy enforcement decisionbased on the entropy of the data asset. Moreover, illustrativeembodiments may define a policy to include sensitivity of the data assetregarding transformation changes. Illustrative embodiments may generatea policy enforcement decision based on sensitivity of the data assetregarding transformation changes.

Illustrative embodiments generate anonymized data for row cells ofcolumns of interest while maintaining the original distribution ofvalues based on policy, which includes the entropy threshold andsensitivity of the data asset regarding transformation. Furthermore, ifthe data asset has a certain level of sensitivity, then illustrativeembodiments utilize a Laplacian noise function to add Laplacian noisewhile performing a distribution-preserving transformation to provideincreased data privacy. The data consumer or user can still utilize thetransformed data by keeping in mind the modification of the distributioncaused by the addition of the Laplacian noise. Adding noise from aLaplacian distribution function to a data asset output (i.e., anonymizeddata values of columns of interest across multiple rows) provides adifferential privacy adjustment to the data asset output to preventdistribution inference. Differential privacy enables sharing informationregarding a data asset by describing patterns within the data assetwhile withholding sensitive information corresponding to individuals inthe data asset.

Illustrative embodiments utilize rectangular data sets known as dataassets herein. Illustrative embodiments can assign a particular dataasset for specific transformation based on one or more policies and thespecific data consumer attempting to access the data asset. Illustrativeembodiments profile each received data asset to detect data classescorresponding to each respective data asset. The policies provide anordered set of transformations needed for specific access requests. Thetransformations are based on the relevant data classes in a specificdata asset and the current policies in the system. The depth ofdistribution preservation is achieved by parametrizing the coefficienttau of the loss function. Illustrative embodiments performpseudo-anonymization transformations only. However, alternativeillustrative embodiments may perform other transformation types withoutusing group column autoencoders, but rather single column autoencoders.

Thus, illustrative embodiments provide one or more technical solutionsthat overcome a technical problem with transforming sensitive data of arequested data asset while preserving distribution of values of the dataasset to a defined degree. As a result, these one or more technicalsolutions provide a technical effect and practical application in thefield of data privacy.

With reference now to FIG. 3 , a diagram illustrating an example of adata discovery, data classification, and autoencoder base training andlibrary maintenance process is depicted in accordance with anillustrative embodiment. Data discovery, data classification, andautoencoder base training and library maintenance process 300 may beimplemented in a computer, such as server 104 in FIG. 1 or dataprocessing system 200 in FIG. 2 .

In this example, data discovery, data discovery, data classification,and autoencoder base training and library maintenance process 300includes raw uncurated input data asset 302, data profiler 304, dataasset catalog 306, data asset profiles and data classes best fithyperplane storage 308, actual data storage 310, and library ofautoencoders 312. However, it should be noted that data discovery, datadiscovery, data classification, and autoencoder base training andlibrary maintenance process 300 is intended as an example only and notas a limitation on illustrative embodiments. In other words, datadiscovery, data discovery, data classification, and autoencoder basetraining and library maintenance process 300 may include more or fewercomponents than illustrated. For example, a component may be dividedinto two or more components, two or more components may be combined intoone component, components not shown may be added, or the like.

Raw uncurated input data asset 302 is a rectangular (e.g., relational)data set comprised of columns and rows. In addition, raw uncurated inputdata asset 302 may represent any type of data set that containssensitive data, such as, for example, names, addresses, telephonenumbers, social security numbers, salary, and the like, which canpersonally identify individuals. Raw uncurated input data asset 302 isinput into data profiler 304. Data profiler 304 may represent any typeof data profiler capable of detecting data classes of interest, whichcontain sensitive information, within raw uncurated input data asset302.

A data distribution preserver, such as, for example, data distributionpreserver 218 in FIG. 2 , registers input data asset 302 with data assetcatalog 306 and determines that input data asset 302 is a new dataasset. The data distribution preserver also stores all data assetprofiles and their corresponding data classes best fit hyperplanes indata asset profiles and data classes best fit hyperplane storage 308. Inaddition, at 314, the data distribution preserver determines whether aset of one or more autoencoders for the new data asset exists in libraryof autoencoders 312.

At 316, if the data distribution preserver determines that a set ofautoencoders for the new data asset does not currently exist in libraryof autoencoders 312, then the data distribution preserver generates anew set of autoencoders for the new data asset. Further, at 318, thedata distribution preserver determines a set of one or more hyperplanesof best fit for the data classes of interest detected while profilingthe new data asset (i.e., raw uncurated input data asset 302).Furthermore, at 320, the data distribution preserver performs a dataread process row-by-row of the new data asset from actual data storage310. Moreover, at 322, the data distribution preserver simulatesenforcement at the data asset level for the new data asset with anadaptive or configured constant distribution preservation thresholdusing as input the determined set of best fit hyperplanes for the dataclasses of interest, the row-by-row data reads, and saved dataclass-based historic transformations 324. If the data distributionpreserver determines that a set of autoencoders for the new data assetdoes currently exist in library of autoencoders 312, then the datadistribution preserver simulates enforcement at the data asset level forthe new data asset with an adaptive or configured constant distributionpreservation threshold using as input the row-by-row data reads andsaved data class-based historic transformations 324.

At 326, the data distribution preserver performs the usual or classicdeterministic transformation of the new data asset, value mappings, andlabeling using row cell value embeddings. At 328, the data distributionpreserver also performs real row cell level reverse mapping using dataclass embeddings. The data distribution preserver stores the real rowcell level reverse mapping in map store 330.

At 332, the data distribution preserver performs at least one of basetraining of the new set of autoencoders for the new data asset oradditional training for one or more existing autoencoders to formautoencoder training set 334. The data distribution preserver utilizesautoencoder training set 334 to train autoencoders in library ofautoencoders 312. Library of autoencoders 312 contains a plurality ofdifferent autoencoders. For example, library of autoencoders 312 mayinclude a group of autoencoders for one data asset, one autoencoder forone data asset, one autoencoder for one data class of interest in a dataasset, one autoencoder for one particular row or transformation type ina data asset, and the like.

With reference now to FIG. 4 , a diagram illustrating an example of adynamic data dissemination with policy enforcement and activeautoencoder training process is depicted in accordance with anillustrative embodiment. Dynamic data dissemination with policyenforcement and active autoencoder training process 400 may beimplemented in a computer, such as server 104 in FIG. 1 or dataprocessing system 200 in FIG. 2 .

In this example, dynamic data dissemination with policy enforcement andactive autoencoder training process 400 includes user 402, datadissemination/access layer 404, previously profiled and curated dataassets 406, policy enforcement point 408, policy decision point 410,actual data storage 412, and library of autoencoders 414. However, itshould be noted that dynamic data dissemination with policy enforcementand active autoencoder training process 400 is intended as an exampleonly and not as a limitation on illustrative embodiments. In otherwords, dynamic data dissemination with policy enforcement and activeautoencoder training process 400 may include more or fewer componentsthan illustrated. For example, a component may be divided into two ormore components, two or more components may be combined into onecomponent, components not shown may be added, or the like.

User 402 is a data consumer. User 402 may be, for example, a human, aprocess, an application, a service, a system, or the like. User 402submits data dissemination request 416 for input data asset 418 to datadissemination/access layer 404. User 402 may submit data disseminationrequest 416 with a particular user context. The user context may be, forexample, location of where data dissemination request 416 was submittedfrom, time of day and day of week user 402 submitted data disseminationrequest 416, and the like. Data dissemination/access layer 404 sendsdata dissemination request 416 to policy enforcement point 408.

Policy enforcement point 408 sends a policy enforcement decision requestcorresponding to data dissemination request 416, the user, and the usercontext of data dissemination request 416 to policy decision point 410.Policy decision point 410 selects a set of policies corresponding todata dissemination request 416, the user, and the user context of datadissemination request 416. Policy decision point 410 generates a dataclass-based policy enforcement decision based on the selected policies.Policy decision point 410 sends the data class-based policy enforcementdecision to policy enforcement point 408. At 420, policy enforcementpoint 408 saves the data class-based policy enforcement decision.

At 422, a data distribution preserver, such as, for example, datadistribution preserver 218 in FIG. 2 , selects a set of autoencoders forinput data asset 418 from library of autoencoders 414. The datadistribution preserver utilizes input data asset 418 as a reference toretrieve actual data from actual data storage 412 while selecting theset of autoencoders at 422. At 424, the data distribution preserverutilizes the selected set of autoencoders for row-centric processing ofa row in a row buffer. At 426, the data distribution preserver utilizesa loss function to perform a loss function value computation for the rowin the row buffer. Further, at 428, the data distribution preservercompares the loss function value to a distribution preservationthreshold that is based on the data class-based policy enforcementdecision. The distribution preservation threshold is an adaptable orconfigured threshold.

At 430, the data distribution preserver makes a determination as towhether the computed loss function value is above the distributionpreservation threshold. If the data distribution preserver determinesthat the computed loss function value is above the distributionpreservation threshold, then the data distribution preserver processesthe row in the row buffer with real row cell value mappings using dataclass value embeddings at 432. The data distribution preserver retrievesthe real row cell value mappings from map store 434. The datadistribution preserver utilizes the processing of the rows in the rowbuffer at 432 as the data dissemination response to data disseminationrequest 416. The data distribution preserver sends the datadissemination response to data dissemination/access layer 404. Datadissemination/access layer 404 then sends the data disseminationresponse to user 402. Alternatively, the data distribution preserver canoptionally generate output data asset 436.

If the data distribution preserver determines that the computed lossfunction value is not above the distribution preservation threshold,then the data distribution preserver utilizes a sampler for random rowsamples from the row buffer at 438. In addition, at 440, the datadistribution preserver saves the random row samples from the row bufferto an under-threshold penalty buffer for autoencoder regularization toprevent overfitting of autoencoders. In the case where the computed lossfunction value was above the distribution preservation threshold, thedata distribution preserver saves the random row samples from the rowbuffer to an over threshold reinforcement buffer at 442.

The data distribution preserver utilizes the under-threshold penaltybuffer and the over threshold penalty buffer to perform labeling withusual or classic deterministic transformation using reverse row cellvalue mapping embeddings from the row buffer at 444. At 446, the datadistribution preserver utilizes the labeling with usual deterministictransformation to generate a small active learning autoencoder trainingset. The smaller the training set, the less time is required to trainthe autoencoders. The data distribution preserver utilizes activelearning autoencoder training set to train autoencoders in library ofautoencoders 414.

With reference now to FIG. 5 , a diagram illustrating an specificexample of an autoencoder with loss function is depicted in accordancewith an illustrative embodiment. Autoencoder with loss function 500 maybe, for example, autoencoder 411 in FIG. 4 . Autoencoder with lossfunction 500 includes autoencoder 502 and loss function 504. It shouldbe noted that autoencoder 502 and loss function 504 are meant asspecific examples of an autoencoder and a loss function only and not aslimitations on illustrative embodiments. In other words, illustrativeembodiments may utilize different autoencoders and loss functions.

For each row of data in a data asset, such as, for example, input dataasset 418 in FIG. 4 , to be transformed, a data distribution preserver,such as, for example, data distribution preserver 218 in FIG. 2 ,selects columns of interest containing sensitive data in the data assetthat need transformation as input to autoencoder 502 with loss function504. The number of layers and depth of bottleneck of autoencoder 502 andloss function 504 determine how each row of data is transformed. Lossfunction 504 also determines a variance measure of each of the columnsof interest. When performed for each respective row, autoencoder 502preservers the original distribution of values of the input data assetto the output data asset.

It should be noted that a set of autoencoders can cover severalcombinations of types of data asset columns. Also, loss functionparametric coefficients provide variability and can be controlled bypolicies. For example, when a value of a particular parametriccoefficient, which measures variance within a column between the inputdata asset and the output data asset, is not zero (0), autoencoder 502is considering projection columns. The data distribution preserver needsto determine canonical columns and create autoencoders that can coverall combinations of autoencoders.

Loss function (LF) 504 has three parametric coefficients arranged as aweighted function. The weights specific to data asset variance providesthe variability of the depth of distribution preservation. Theparametric coefficient rho (ρ) of the loss function measures columnspecific variance over the data asset. In other words, rho minimizes thedistance between the mean of the columns of interest containing relevantdata classes over the entire data asset. The parametric coefficient phi(ϕ) of the loss function measures intra-row/inter-column specificvariance. In other words, phi minimizes the distance between columns ofinterest within a particular row of data. The parametric coefficient tau(τ) of the loss function measures data asset specific variance. In otherwords, tau minimizes the orthogonal distance of the output row to thebest fitting hyperplane of the data asset. The data distributionpreserver generates the hyperplane based on relevant data classes of thedata asset. Thus, LF=ρ(variance within a column of interest)+ϕ(intra-rowcolumns of interest distance)+τ(orthogonal distance from best fithyperplane). It should be noted that loss function 504 may be computedpre- or post-mapping of real to pseudo row values.

With reference now to FIG. 6 , a flowchart illustrating a process fordata classification and autoencoder base training is shown in accordancewith an illustrative embodiment. The process shown in FIG. 6 may beimplemented in a computer, such as, for example, server 104 in FIG. 1 ordata processing system 200 in FIG. 2 . For example, the process shown inFIG. 6 may be implemented in data distribution preserver 218 in FIG. 2 .

The process begins when the computer receives a data asset as input(step 602). The computer profiles actual data of the data asset using adata profiler (step 604). The computer detects data classes of interestcorresponding to the data asset by column based on profiling the actualdata of the data asset (step 606).

The computer generates a best fit hyperplane for the data assetseparating data values based on the data classes of interestcorresponding to the data asset (step 608). The computer persists thebest fit hyperplane corresponding to the data asset (step 610). The bestfit hyperplane represents a base distribution signature of the dataasset and a 0% distribution preservation distance threshold of the dataasset. The computer utilizes the best fit hyperplane during datadissemination to compute the parametric coefficients of the lossfunction in conjunction with the prescribed distribution preservationdirective. It should be noted that a 100% distribution preservationdirective represents full preservation of the input data asset to bereflected in the output data asset and a 0% distribution preservationdirective that is a “don't care” point in producing the datatransformations by the autoencoder of the data classes of interest. Thecomputer calculates the loss function threshold value by scaling theworst or largest orthogonal distance observed between all rows of datain the input data asset and the generated best fit hyperplane. Thecomputer saves the largest cartesian distance from the input data asset,as well as “don't care” point or 0% distribution preservation directivein scaling the policy as a percentage.

The computer searches a library of autoencoders for a set ofautoencoders that corresponds to the data classes of interest targetedfor anonymization based on historic enforcement and simulatedenforcement of policies associated with the data asset (step 612). Thecomputer makes a determination as to whether a set of autoencodercorresponding to all of the data classes of interest was found in thesearch (step 614). If the computer determines that a set of autoencodercorresponding to all of the data classes of interest was found in thesearch, yes output of step 614, then the process terminates thereafter.If the computer determines that a set of autoencoders corresponding toall of the data classes of interest was not found in the search, nooutput of step 612, then the computer generates a new randomlyinitialized autoencoder for all of the data classes of interest based onthe historic enforcement and the simulated enforcement of the policiesassociated with the data asset (step 616). Furthermore, the computerbase trains the new randomly initialized autoencoder using a reversemapping of transformed row cell values obtained from a classicaldeterministic transformation of input rows to pseudo row cell valuessuitable for autoencoder training (step 618). The classicaldeterministic transformation is a ground truth row cell value generationmethod using raw input row cell values. Afterward, the computer adds thebase trained new autoencoder to the library of autoencoders (step 620).Thereafter, the process terminates.

With reference now to FIGS. 7A-7C, a flowchart illustrating a processfor policy enforcement to transform sensitive data is shown inaccordance with an illustrative embodiment. The process shown in FIGS.7A-7C may be implemented in a computer, such as, for example, server 104in FIG. 1 or data processing system 200 in FIG. 2 . For example, theprocess shown in FIGS. 7A-7C may be implemented in data distributionpreserver 218 in FIG. 2 .

The process begins when the computer receives a request to access dataof a specific input data asset from a client device of a specific uservia a network (step 702). The specific input data asset is a rectangulardata set. In response to the computer receiving the request, a policyenforcement point of the computer requests a policy enforcement decisionfrom a policy decision point of the computer regarding the specificinput data asset, the specific user, and a context associated with therequest (step 704). The policy decision point of the computer generatesthe policy enforcement decision regarding the specific input data asset,the specific user, and the context of the request based on a set ofcurrently set policies (step 706). It should be noted that the policyenforcement decision also contains a percentage of desired datadistribution preservation for the data classes of interest that mayrequire transformation by a selected autoencoder of a library ofautoencoders. This provides the necessary data classes to be transformedas dictated by policy and the data distribution preservation directiveor threshold. In addition, the computer calculates a loss functionthreshold value for a loss function based on the policy enforcementdecision (step 708).

Further, the computer selects an autoencoder from a library ofautoencoders to perform needed data anonymizations on columns ofinterest containing sensitive data in the specific input data assetbased on the policy enforcement decision (step 710). Afterward, thecomputer selects a row in the specific input data asset (step 712). Thecomputer transcribes original input data values of the selected row to atemporary buffer (step 714). The computer performs the needed dataanonymizations of the selected row using the selected autoencoder fortransforming data values of the sensitive data in an associated set ofrow cells of the columns of interest to a transform buffer (step 716).The computer also generates a loss function value for the dataanonymizations in the selected row using a loss function with parametriccoefficients specified in the policy enforcement decision (step 718).

The computer compares the generated loss function value to thecalculated loss function threshold value (step 720). The computer makesa determination as to whether the generated loss function value is lessthan the calculated loss function threshold value based on thecomparison (step 722).

If the computer determines that the generated loss function value is notless than the calculated loss function threshold value based on thecomparison, no output of step 722, then the computer transcribestransformed data values in the transform buffer using forward mapping toreal row cell values suitable for the specific user to an output bufferlabeled as output (step 724). Thereafter, the process proceeds to step726. If the computer determines that the generated loss function valueis less than the calculated loss function threshold value based on thecomparison, yes output of step 722, then the computer transfers theoutput buffer labeled output to the next row for an output of thespecific input data asset (step 726).

Furthermore, the computer makes a determination as to whether thetemporary buffer qualifies for use in an autoencoder active retrainingprocess based on the calculated loss function threshold value and savedmoving average threshold (step 728). If the computer determines that thetemporary buffer does not qualify for use in the autoencoder activeretraining process, no output of step 728, then the computer makes adetermination as to whether another row exists in the specific inputdata asset (step 730). If the computer determines that another row doesexist in the specific input data asset, yes output of step 730, then theprocess returns to step 712 where the computer selects another row inthe specific input data asset. If the computer determines that anotherrow does not exist in the selected column, no output of step 730, thenthe computer sends the output for the specific input data asset to theclient device of the specific user via the network (step 732).Thereafter, the process terminates.

Returning again to step 728, if the computer determines that thetemporary buffer does qualify for use in the autoencoder activeretraining process, yes output of step 728, then the computer makes adetermination as to whether the generated loss function value was lessthan the calculated loss function threshold value (step 734). If thecomputer determines that the generated loss function value was not lessthan the calculated loss function threshold value, no output of step734, then the computer labels the temporary buffer of the original inputdata values as a good candidate (step 736). Thereafter, the processproceeds to step 740. If the computer determines that the generated lossfunction value was less than the calculated loss function thresholdvalue, yes output of step 734, then the computer labels the temporarybuffer of the original input data values as a reject candidate (step738).

Afterward, the computer saves the labeled output row to a trainingbuffer (step 740). In addition, the computer passes the training bufferthrough a data sampler to form a sampled training buffer (step 742). Inone illustrative embodiment, the data sampler is a random data sampler.The computer persists the sampled training buffer (step 744).

Further, the computer asynchronously retrains specific autoencodersusing a reverse mapping of transformed row cell values obtained from theclassical deterministic transformation of input rows of the trainingbuffer to pseudo row cell values suitable for autoencoder training (step746). The computer additionally retrains the specific autoencoders inthe library of autoencoders using the sampled training buffer based onreinforcement for good candidates and regularization or general methodsfor overfitting avoidance for reject candidates (step 748). It should benoted that over time the retraining of autoencoders will usebackpropagation and converge to a most frequently used threshold of datadistribution preservation for a specific data class and autoencodercombination. Also, alternative illustrative embodiments may index thelibrary of autoencoders by threshold so that when an autoencoder issearched for in the library, the threshold may also play a role in theselection process. The computer also saves the moving averagedcalculated loss function threshold with a value that was used for thespecific input data asset (step 750). Thereafter, the process returns tostep 730 where the computer determines whether another row exists it thespecific input data asset.

Thus, illustrative embodiments of the present invention provide acomputer-implemented method, computer system, and computer programproduct for dynamically transforming sensitive data of a data asset inreal time during data dissemination to a requesting data consumer. Thespecific transformation to the requested data during an anonymizationoperation is achieved while preserving transformed values of the outputdata distributions to a desired degree relative to the input data.Illustrative embodiments control this process declaratively based onpolicy using an autoencoder with parametrized loss function. Thedescriptions of the various embodiments of the present invention havebeen presented for purposes of illustration, but are not intended to beexhaustive or limited to the embodiments disclosed. Many modificationsand variations will be apparent to those of ordinary skill in the artwithout departing from the scope and spirit of the describedembodiments. The terminology used herein was chosen to best explain theprinciples of the embodiments, the practical application or technicalimprovement over technologies found in the marketplace, or to enableothers of ordinary skill in the art to understand the embodimentsdisclosed herein.

What is claimed is:
 1. A computer-implemented method for preservingdistributions of data values of a data asset in a data anonymizationoperation, the computer-implemented method comprising: performing dataanonymizations of a selected row in the data asset using an autoencoderfor transforming data values of sensitive data in an associated set ofrow cells of columns of interest to a transform buffer; generating aloss function value for the data anonymizations in the selected rowusing a loss function with parametric coefficients specified in a policyenforcement decision; comparing the loss function value to a lossfunction threshold value; transcribing transformed data values in thetransform buffer using forward mapping to real row cell values suitablefor a specific user to an output buffer labeled as output in response todetermining that the loss function value is greater than the lossfunction threshold value based on the comparing; and transferring theoutput buffer labeled output to a next row for an output of the dataasset.
 2. The computer-implemented method of claim 1 further comprising:sending the output for the data asset to a client device of a requestinguser via a network.
 3. The computer-implemented method of claim 1further comprising: receiving a request to access data of the data assetfrom a client device of the specific user via a network, wherein thedata asset is a rectangular data set comprised of columns and rows;requesting the policy enforcement decision regarding the data asset, thespecific user, and a context of the request to access the data of thedata asset; generating the policy enforcement decision regarding thedata asset, the specific user, and the context of the request to accessthe data of the data asset; and calculating the loss function thresholdvalue for the loss function based on the policy enforcement decision. 4.The computer-implemented method of claim 1 further comprising: selectingthe autoencoder from a library of autoencoders to perform the dataanonymizations on the columns of interest containing the sensitive datain the data asset based on the policy enforcement decision; andselecting a row of a plurality of rows in the data asset to form theselected row.
 5. The computer-implemented method of claim 1 furthercomprising: determining whether a temporary buffer of transcribedoriginal input data values of the selected row qualifies for use in anautoencoder active retraining process; responsive to determining thatthe temporary buffer does qualify for use in the autoencoder activeretraining process, determining whether the loss function value was lessthan the loss function threshold value; responsive to determining thatthe loss function value was not less than the loss function thresholdvalue, labeling the temporary buffer as a good candidate or responsiveto determining that the loss function value was less than the lossfunction threshold value, labeling the temporary buffer as a rejectcandidate; and saving a labeled output row to a training buffer.
 6. Thecomputer-implemented method of claim 5 further comprising: passing thetraining buffer through a data sampler to form a sampled trainingbuffer; asynchronously retraining specific autoencoders using a reversemapping of transformed row cell values obtained from a classicaldeterministic transformation of input rows of the training buffer topseudo row cell values suitable for autoencoder training; andadditionally retraining the specific autoencoders using the sampledtraining buffer based on reinforcement for good candidates andregularization for overfitting avoidance for reject candidates.
 7. Thecomputer-implemented method of claim 1 further comprising: profilingactual data of the data asset; detecting data classes of interestcorresponding to the data asset by column based on the profiling of theactual data of the data asset; and generating a best fit hyperplane forthe data asset separating data values based on the data classes ofinterest corresponding to the data asset.
 8. The computer-implementedmethod of claim 7 further comprising: generating a new randomlyinitialized autoencoder for the data classes of interest based onhistoric enforcement and simulated enforcement of policies associatedwith the data asset in response to determining that an autoencodercorresponding to the data classes of interest was not found in a searchof a library of autoencoders; and base training the new randomlyinitialized autoencoder using a reverse mapping of transformed row cellvalues obtained from a classical deterministic transformation of inputrows to pseudo row cell values suitable for autoencoder training.
 9. Thecomputer-implemented method of claim 1, wherein a Laplacian noisefunction is applied to anonymized data values as a differential privacyadjustment to prevent distribution inference.
 10. Thecomputer-implemented method of claim 1, wherein the policy enforcementdecision is based on entropy of the data asset.
 11. Thecomputer-implemented method of claim 1, wherein the policy enforcementdecision is based on sensitivity of the data asset regardingtransformation changes.
 12. A computer system for preservingdistributions of data values of a data asset in a data anonymizationoperation, the computer system comprising: a bus system; a storagedevice connected to the bus system, wherein the storage device storesprogram instructions; and a processor connected to the bus system,wherein the processor executes the program instructions to: perform dataanonymizations of a selected row in the data asset using an autoencoderfor transforming data values of sensitive data in an associated set ofrow cells of columns of interest to a transform buffer; generate a lossfunction value for the data anonymizations in the selected row using aloss function with parametric coefficients specified in a policyenforcement decision; compare the loss function value to a loss functionthreshold value; transcribe transformed data values in the transformbuffer using forward mapping to real row cell values suitable for aspecific user to an output buffer labeled as output in response todetermining that the loss function value is greater than the lossfunction threshold value; and transfer the output buffer labeled outputto a next row for an output of the data asset.
 13. The computer systemof claim 12, wherein the processor further executes the programinstructions to: send the output for the data asset to a client deviceof a requesting user via a network.
 14. The computer system of claim 12,wherein the processor further executes the program instructions to:receive a request to access data of the data asset from a client deviceof the specific user via a network, wherein the data asset is arectangular data set comprised of columns and rows; request the policyenforcement decision regarding the data asset, the specific user, and acontext of the request to access the data of the data asset; generatethe policy enforcement decision regarding the data asset, the specificuser, and the context of the request to access the data of the dataasset; and calculate the loss function threshold value for the lossfunction based on the policy enforcement decision.
 15. A computerprogram product for preserving distributions of data values of a dataasset in a data anonymization operation, the computer program productcomprising a computer-readable storage medium having programinstructions embodied therewith, the program instructions executable bya computer to cause the computer to a method of: performing dataanonymizations of a selected row in the data asset using an autoencoderfor transforming data values of sensitive data in an associated set ofrow cells of columns of interest to a transform buffer; generating aloss function value for the data anonymizations in the selected rowusing a loss function with parametric coefficients specified in a policyenforcement decision; comparing the loss function value to a lossfunction threshold value; transcribing transformed data values in thetransform buffer using forward mapping to real row cell values suitablefor a specific user to an output buffer labeled as output in response todetermining that the loss function value is greater than the lossfunction threshold value based on the comparing; and transferring theoutput buffer labeled output to a next row for an output of the dataasset.
 16. The computer program product of claim 15 further comprising:sending the output for the data asset to a client device of a requestinguser via a network.
 17. The computer program product of claim 15 furthercomprising: receiving a request to access data of the data asset from aclient device of the specific user via a network, wherein the data assetis a rectangular data set comprised of columns and rows; requesting thepolicy enforcement decision regarding the data asset, the specific user,and a context of the request to access the data of the data asset;generating the policy enforcement decision regarding the data asset, thespecific user, and the context of the request to access the data of thedata asset; and calculating the loss function threshold value for theloss function based on the policy enforcement decision.
 18. The computerprogram product of claim 15 further comprising: selecting theautoencoder from a library of autoencoders to perform the dataanonymizations on the columns of interest containing the sensitive datain the data asset based on the policy enforcement decision; andselecting a row of a plurality of rows in the data asset to form theselected row.
 19. The computer program product of claim 15 furthercomprising: determining whether a temporary buffer of transcribedoriginal input data values of the selected row qualifies for use in anautoencoder active retraining process; responsive to determining thatthe temporary buffer does qualify for use in the autoencoder activeretraining process, determining whether the loss function value was lessthan the loss function threshold value; responsive to determining thatthe loss function value was not less than the loss function thresholdvalue, labeling the temporary buffer as a good candidate or responsiveto determining that the loss function value was less than the lossfunction threshold value, labeling the temporary buffer as a rejectcandidate; and saving a labeled output row to a training buffer.
 20. Thecomputer program product of claim 19 further comprising: passing thetraining buffer through a data sampler to form a sampled trainingbuffer; asynchronously retraining specific autoencoders using a reversemapping of transformed row cell values obtained from a classicaldeterministic transformation of input rows of the training buffer topseudo row cell values suitable for autoencoder training; andadditionally retraining the specific autoencoders using the sampledtraining buffer based on reinforcement for good candidates andregularization for overfitting avoidance for reject candidates.